Negative evidence and inductive generalisation

نویسندگان

  • Charles W. Kalish
  • Christopher A. Lawson
چکیده

How do people use past experience to generalise to novel cases? This paper reports four experiments exploring the significance on one class of past experiences: encounters with negative or contrasting cases. In trying to decide whether all ravens are black, what is the effect of learning about a non-raven that is not black? Two experiments with preschool-aged, young school-aged, and adult participants revealed that providing a negative example in addition to a positive example supports generalisation. Two additional experiments went on to ask which kinds of negative examples offer the most support for generalisations. These studies contrasted similarity-based and category-based accounts of inductive generalisation. Results supported category-based predictions, but only for preschool-aged children. Overall, the younger children showed a greater reliance on negative evidence than did older children and adults. Most things we encounter in the world are negative evidence for our generalisations. Understanding the role of negative evidence is central for psychological theories of inductive generalisation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Abductive Inductive Learning: A Generalisation of Progol

The learning system Progol5 and the underlying inference method of Bottom Generalisation are firmly established within Inductive Logic Programming (ILP). But despite their success, it is known that Bottom Generalisation, and therefore Progol5, are restricted to finding hypotheses that lie within the semantics of Plotkin’s relative subsumption. This paper exposes a previously unknown incompleten...

متن کامل

Learning Stochastic Logical Automaton

This paper is concerned with algorithms for the logical generalisation of probabilistic temporal models from examples. The algorithms combine logic and probabilistic models through inductive generalisation. The inductive generalisation algorithms consist of three parts. The first part describes the graphical generalisation of state transition models. State transition models are generalised by a...

متن کامل

Hybrid abductive inductive learning

This thesis introduces a new Machine Learning technique called Hybrid Abductive Inductive Learning (HAIL) that integrates Abductive Logic Programming (ALP) and Inductive Logic Programming (ILP) in order to automate the learning of first-order theories from examples and prior knowledge. A semantics is proposed called Kernel Set Subsumption (KSS) that generalises the well-known inference method o...

متن کامل

Utilising Multiple Inductive Bias in Classification:

ii Chapter 1 " Every generalisation is dangerous, especially this one. " – Mark Twain

متن کامل

subsumption for structural matching

Structural matching originally introduced by Steven Vere in the mid seventies was a popular sub eld of inductive concept learning in the late seventies and early eighties Despite various attempts to formalize and implement the notion of most speci c generalisation of two productions several problems remained These include using background knowledge the non uniqueness of most speci c generalisat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007